27 research outputs found
Fast Estimations of Hitting Time of Elitist Evolutionary Algorithms from Fitness Levels
The fitness level method is an easy-to-use tool for estimating the hitting
time of elitist EAs. Recently, general linear lower and upper bounds from
fitness levels have been constructed. However, the construction of these bounds
requires recursive computation, which makes them difficult to use in practice.
We address this shortcoming with a new directed graph (digraph) method that
does not require recursive computation and significantly simplifies the
calculation of coefficients in linear bounds. In this method, an EA is modeled
as a Markov chain on a digraph. Lower and upper bounds are directly calculated
using conditional transition probabilities on the digraph. This digraph method
provides straightforward and explicit expressions of lower and upper time bound
for elitist EAs. In particular, it can be used to derive tight lower bound on
both fitness landscapes without and with shortcuts. This is demonstrated
through four examples: the (1+1) EA on OneMax, FullyDeceptive, TwoMax1 and
Deceptive. Our work extends the fitness level method from addressing simple
fitness functions without shortcuts to more realistic functions with shortcuts
A new framework for analysis of coevolutionary systems:Directed graph representation and random walks
Studying coevolutionary systems in the context of simplified models (i.e. games with pairwise interactions between coevolving solutions modelled as self plays) remains an open challenge since the rich underlying structures associated with pairwise comparison-based fitness measures are often not taken fully into account. Although cyclic dynamics have been demonstrated in several contexts (such as intransitivity in coevolutionary problems), there is no complete characterization of cycle structures and their effects on coevolutionary search. We develop a new framework to address this issue. At the core of our approach is the directed graph (digraph) representation of coevolutionary problem that fully captures structures in the relations between candidate solutions. Coevolutionary processes are modelled as a specific type of Markov chains ? random walks on digraphs. Using this framework, we show that coevolutionary problems admit a qualitative characterization: a coevolutionary problem is either solvable (there is a subset of solutions that dominates the remaining candidate solutions) or not. This has an implication on coevolutionary search. We further develop our framework that provide the means to construct quantitative tools for analysis of coevolutionary processes and demonstrate their applications through case studies. We show that coevolution of solvable problems corresponds to an absorbing Markov chain for which we can compute the expected hitting time of the absorbing class. Otherwise, coevolution will cycle indefinitely and the quantity of interest will be the limiting invariant distribution of the Markov chain. We also provide an index for characterizing complexity in coevolutionary problems and show how they can be generated in a controlled mannerauthorsversionPeer reviewe
Measuring Generalization Performance in Coevolutionary Learning
Abstract—Coevolutionary learning involves a training process where training samples are instances of solutions that interact strategically to guide the evolutionary (learning) process. One main research issue is with the generalization performance, i.e., the search for solutions (e.g., input–output mappings) that best predict the required output for any new input that has not been seen during the evolutionary process. However, there is currently no such framework for determining the generalization performance in coevolutionary learning even though the notion of generalization is well-understood in machine learning. In this paper, we introduce a theoretical framework to address this research issue. We present the framework in terms of game-playing although our results are more general. Here, a strategy’s generalization performance is its average performance against all test strategies. Given that the true value may not be determined b